DNS Data Exfiltration Detection Using Online Planning for POMDP
نویسندگان
چکیده
منابع مشابه
DESPOT: Online POMDP Planning with Regularization
POMDPs provide a principled framework for planning under uncertainty, but are computationally intractable, due to the “curse of dimensionality” and the “curse of history”. This paper presents an online search algorithm that alleviates these difficulties by focusing on a set of sampled scenarios. The execution of all policies on the sampled scenarios is captured in a Determinized Sparse Partiall...
متن کاملDetection of Malicious and Low Throughput Data Exfiltration Over the DNS Protocol
In the presence of security countermeasures, a malware designed for data exfiltration must do so using a covert channel to achieve its goal. Among existing covert channels stands the domain name system (DNS) protocol. Although the detection of covert channels over the DNS has been thoroughly studied in the last decade, previous research dealt with a specific subclass of covert channels, namely ...
متن کاملAn Online POMDP Solver for Uncertainty Planning in Dynamic Environment
Motion planning under uncertainty is important for reliable robot operations in uncertain and dynamic environments. Partially Observable Markov Decision Process (POMDP) is a general and systematic framework for motion planning under uncertainty. To cope with dynamic environment well, we often need to modify the POMDP model during runtime. However, despite recent tremendous advances in POMDP pla...
متن کاملmetrics for the detection of changed buildings in 3d old vector maps using als data (case study: isfahan city)
هدف از این تحقیق، ارزیابی و بهبود متریک های موجود جهت تایید صحت نقشه های قدیمی سه بعدی برداری با استفاده از ابر نقطه حاصل از لیزر اسکن جدید شهر اصفهان می باشد . بنابراین ابر نقطه حاصل از لیزر اسکنر با چگالی حدودا سه نقطه در هر متر مربع جهت شناسایی عوارض تغییر کرده در نقشه های قدیمی سه بعدی استفاده شده است. تمرکز ما در این تحقیق بر روی ساختمان به عنوان یکی از اصلی ترین عارضه های شهری می باشد. من...
Online Appendix: A Stackelberg Game Model for Botnet Data Exfiltration
Proof. Let’s consider an arbitrary instance of the urban network security problem. There is an urban road network which is represented as a graph G = (V,E). The attacker starts at one of the source nodes s ∈ S ⊂ V and travels along a path to attack one of the targets t ∈ T ⊂ V. The attacker’s pure strategies are all possible paths in the graph, each starts from a source s ∈ S and ends at a targ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Engineering Research and Science
سال: 2019
ISSN: 2506-8016
DOI: 10.24018/ejers.2019.4.9.1500